Overall Objectives
Research Program
Application Domains
New Results
- Improved Complexity Bounds for Counting Points on Hyperelliptic Curves
- Deciphering of a Code Used by a 19th Century Parisian Violin Dealer
- Discrete Logarithm Record Computation in Extension Fields
- Using Constraint Programming to Solve a Cryptanalytic Problem
- Optimized Binary64 and Binary128 Arithmetic with GNU MPFR
- A New Measure for Root Optimization
- Mathematical Computation with SageMath
- Topics in Computational Number Theory Inspired by Peter L. Montgomery
- Improved Methods for Finding Optimal Formulae for Bilinear Maps in a Finite Field
- Big Prime Field FFT on the GPU
- CM Plane Quartics
- Explicit Isogenies in Genus 2 and 3
- Modular Polynomials of Hilbert Surfaces
- Individual Logarithm Step in Non-prime Fields
- Last Year Results that Appeared in 2017
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Bibliography
Overall Objectives
Research Program
Application Domains
New Results
- Improved Complexity Bounds for Counting Points on Hyperelliptic Curves
- Deciphering of a Code Used by a 19th Century Parisian Violin Dealer
- Discrete Logarithm Record Computation in Extension Fields
- Using Constraint Programming to Solve a Cryptanalytic Problem
- Optimized Binary64 and Binary128 Arithmetic with GNU MPFR
- A New Measure for Root Optimization
- Mathematical Computation with SageMath
- Topics in Computational Number Theory Inspired by Peter L. Montgomery
- Improved Methods for Finding Optimal Formulae for Bilinear Maps in a Finite Field
- Big Prime Field FFT on the GPU
- CM Plane Quartics
- Explicit Isogenies in Genus 2 and 3
- Modular Polynomials of Hilbert Surfaces
- Individual Logarithm Step in Non-prime Fields
- Last Year Results that Appeared in 2017
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
Bibliography
Previous | 
Home